n=int(input())
s=input()
c1 = s.count('x')
c2 = s.count('X')
s = s.replace('x', 'X', max(0, (c1-c2)//2))
s = s.replace('X', 'x', max(0, (c2-c1)//2))
print(abs(c2-c1)//2)
print(s)
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
ll _=1;
//cin >> _;
while(_--)
{
ll n,i,cnt=0;
cin >> n;
string s;
cin >> s;
for(i=0; i<n; i++)
{
if(s[i]=='X')
cnt++;
}
cout << abs((n/2)-cnt) << endl;
if(abs((n/2)-cnt)==0)
{
cout << s << endl;
return 0;
}
else
{
ll temp=(n/2)-cnt;
if(temp>0)
{
for(i=0; i<n; i++)
{
if(s[i]=='x' && temp!=0)
{
s[i]='X';
temp--;
}
}
}
else
{
for(i=0; i<n; i++)
{
if(s[i]=='X' && temp!=0)
{
s[i]='x';
temp++;
}
}
}
cout << s << endl;
}
}
return 0;
}
841. Keys and Rooms | 152. Maximum Product Subarray |
337. House Robber III | 869. Reordered Power of 2 |
1593C - Save More Mice | 1217. Minimum Cost to Move Chips to The Same Position |
347. Top K Frequent Elements | 1503. Last Moment Before All Ants Fall Out of a Plank |
430. Flatten a Multilevel Doubly Linked List | 1290. Convert Binary Number in a Linked List to Integer |
1525. Number of Good Ways to Split a String | 72. Edit Distance |
563. Binary Tree Tilt | 1306. Jump Game III |
236. Lowest Common Ancestor of a Binary Tree | 790. Domino and Tromino Tiling |
878. Nth Magical Number | 2099. Find Subsequence of Length K With the Largest Sum |
1608A - Find Array | 416. Partition Equal Subset Sum |
1446. Consecutive Characters | 1618A - Polycarp and Sums of Subsequences |
1618B - Missing Bigram | 938. Range Sum of BST |
147. Insertion Sort List | 310. Minimum Height Trees |
2110. Number of Smooth Descent Periods of a Stock | 2109. Adding Spaces to a String |
2108. Find First Palindromic String in the Array | 394. Decode String |